The Design and Assessment of next Generation Automated Container Terminals

نویسندگان

  • Yvo Saanen
  • Jeroen van Meel
  • Alexander Verbraeck
چکیده

One of the answers to the ever-increasing transhipment volumes that are required within the same timeframe at the quays of the world's large container ports, is the automation of the processes. However, until now ECT in Rotterdam and HHLA (CTA) in Hamburg are still the only two stevedores that have fully automated the transport from quay to stack as well as the stacking operations. Both operators have chosen to apply RMGs in combination with AGVs. However, a new automated concept is about to be introduced: the automated lifting vehicle (ALV). In this paper a comparison by means of simulation and cost modelling is made between the operational productivity of an AGV-RMG and an ALVRMG terminal. We will show the pro’s and con’s of each concept and assess the dynamic behaviour in a detailed simulation model. Furthermore, we will compare the two automated concepts with a manually operated shuttle carrier (a 1 over 1 straddle carrier, in essence). The results show that for cost reasons, the ALV should not be preferred over AGVs, although you less vehicles to achieve the same quay crane productivity. Furthermore, ALVs are not yet to be considered as proven technology, which is for most terminals an important criterion to assess the project risk..

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

متن کامل

Scheduling Single-Load and Multi-Load AGVs in Container Terminals

In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...

متن کامل

Cost Function Modelling for Semi-automated SC, RTG and Automated and Semi-automated RMG Container Yard Operating Systems

This study analyses the concept of cost functions for semi-automated Straddle Carrier (SC), Rubber Tyred Gantry (RTG) and automated Rail Mounted Gantry (RMG) container yard operating cranes. It develops a generic cost based model for a pair-wise comparison, analysis and evaluation of economic efficiency and effectiveness of container yard equipment to be used for decision-making by terminal pla...

متن کامل

Scheduling in Container Terminals using Network Simplex Algorithm

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

متن کامل

Yard Crane Pools and Optimum Layouts for Storage Yards of Container Terminals

As more and more container terminals open up all over the world, competition for business is becoming very intense for container terminal operators. They are finding out that even to keep their existing Sea Line customers, they have to make them happy by offering higher quality service. The quality of service they can provide depends on their operating policies and the design of the terminal la...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003